Electric vehicle routing problem with time windows, recharging stations and battery swapping stations
نویسندگان
چکیده
منابع مشابه
The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations
Driven by new laws and regulations concerning the emission of greenhouse gases, carriers are starting to use battery electric vehicles (BEVs) for last-mile deliveries. The limited battery capacities of BEVs necessitate visits to recharging stations during delivery tours of industry-typical length, which have to be considered in the route planning in order to avoid inefficient vehicle routes wit...
متن کاملAppendix of: The Electric Vehicle Routing Problem with Time Windows and Recharging Stations
We compiled an improved version of the G-VRP model of Erdogan and Miller-Hooks (2012) and used it to solve the set of small G-VRP benchmark instances with CPLEX. To be concise, we use the original notation from Erdogan and Miller-Hooks (2012) to describe our model:
متن کاملThe Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
Due to new regulations and further technological progress in the field of electric vehicles, the research community faces the new challenge of incorporating the electric energy based restrictions into vehicle routing problems. One of these restrictions is the limited battery capacity which makes detours to recharging stations necessary, thus requiring efficient tour planning mechanisms in order...
متن کاملA mathematical model for the electric vehicle routing with time windows considering queuing system at charging stations and alternative paths
Due to many damages that human activities have imposed on the environment, authorities, manufacturers, and industry owners have taken into account the development of supply chain more than ever. One of the most influential and essential human activities in the supply chain are transportation which green vehicles such as electric vehicles (EVs) are expected to generate higher economic and enviro...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURO Journal on Transportation and Logistics
سال: 2018
ISSN: 2192-4376
DOI: 10.1007/s13676-018-0136-9